Statement Inversion and Strongest Postcondition
نویسندگان
چکیده
A notion of inverse commands is deened for a language with a weakest precondition semantics, permitting both demonic and angelic nondeterminism as well as miracles and nontermination. Every conjunctive and terminating command is invertible, the inverse being non-miraculous and disjunctive. A simulation relation between commands is described using inverse commands. A generalized form of inverse is deened for arbitrary conjunc-tive commands. The generalized inverses are shown to be closely related to strongest postconditions.
منابع مشابه
Kleene under a modal demonic star
In relational semantics, the input-output semantics of a program is a relation on its set of states. We generalise this in considering elements of Kleene algebras as semantical values. In a nondeterministic context, the demonic semantics is calculated by considering the worst behaviour of the program. In this paper, we concentrate on while loops. Calculating the semantics of a loop is difficult...
متن کاملL-fuzzy strongest postcondition predicate transformers as L-idempotent linear or affine operators between semimodules of monotonic predicates
For a completely distributive quantale L, L-fuzzy strongest postcondition predicate transformers are introduced, and it is shown that, under reasonable assumptions, they are linear or affine continuous mappings between continuous L-idempotent semimodules of L-fuzzy monotonic predicates. © 2012 Elsevier B.V. All rights reserved.
متن کاملwin and sin : Predicate Transformers for Concurrency LESLIE LAMPORT Digital
The weakest liberal precondition and strongest postcondition predicate transformers are generalized to the weakest invariant and strongest invariant. These new predicate transformers are useful for reasoning about concurrent programs containing operations in which the grain of atomicity is unspecified. They can also be used to replace behavioral arguments with more rigorous assertional ones.
متن کاملwin and sin : Predicate Transformers for Concurrency LESLIE LAMPORT
The weakest liberal precondition and strongest postcondition predicate transformers are generalized to the weakest invariant and strongest invariant. These new predicate transformers are useful for reasoning about concurrent programs containing operations in which the grain of atomicity is unspecified. They can also be used to replace behavioral arguments with more rigorous assertional ones.
متن کاملComplete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE'S
A system of polynomial ordinary differential equations (ode's) is specified via a vector of multivariate polynomials, or vector field, F. A safety assertion psi->[F]phi means that the system's trajectory will lie in a subset phi (the postcondition) of the state-space, whenever the initial state belongs to a subset psi (the precondition). We consider the case when phi and psi are algebraic varie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Sci. Comput. Program.
دوره 20 شماره
صفحات -
تاریخ انتشار 1993